Fuzzy decision trees
نویسنده
چکیده
Decision trees are arguably one of the most popular choices for learning and reasoning systems, especially when it comes to learning from discrete valued (feature based) examples. Because of the success they acquired in their area, there have been many attempts to generalize the method to better suit working with real-valued, numerical attributes, but also for missing values or even numerical outcomes (i.e. for regression tasks). In this paper, we will present a few methods aiming to combine the increased readability of decision trees with the ability to deal with numeric or inaccurate data provided by fuzzy reasoning.
منابع مشابه
A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملA Novel Approach on Designing Augmented Fuzzy Cognitive Maps Using Fuzzified Decision Trees
This paper proposes a new methodology for designing Fuzzy Cognitive Maps using crisp decision trees that have been fuzzified. Fuzzy cognitive map is a knowledge-based technique that works as an artificial cognitive network inheriting the main aspects of cognitive maps and artificial neural networks. Decision trees, in the other hand, are well known intelligent techniques that extract rules from...
متن کاملFuzzy-Rough Feature Significance for Fuzzy Decision Trees
Crisp decision trees are one of the most popular classification algorithms in current use within data mining and machine learning. However, although they possess many desirable features, they lack the ability to model vagueness. As a result of this, the induction of fuzzy decision trees (FDTs) has become an area of much interest. One important aspect of tree induction is the choice of feature a...
متن کاملFuzzyDT- A Fuzzy Decision Tree Algorithm Based on C4.5
Decision trees have been successfully applied to many areas for tasks such as classi cation, regression, and feature subset selection. Decision trees are popular models in machine learning due to the fact that they produce graphical models, as well as text rules, that end users can easily understand. Moreover, their induction process is usually fast, requiring low computational resources. Fuzzy...
متن کاملOptimized Fuzzy Decision Tree for Structured Continuous-Label Classification
Mainly understandable decision trees have been intended for perfect symbolic data. Conventional crisp decision trees (DT) are extensively used for classification purpose. However, there are still many issues particularly when we used the numerical (continuous valued) attributes. Structured continuouslabel classification is one type of classification in which the label is continuous in the data....
متن کاملReview of Fuzzy Decision Tree: An improved Decision Making Classifier
Over the years, various methodologies have been investigated and proposed to deal with continuous or numeric data which is very common in any application. With the increasing popularity of fuzzy representation, researchers have proposed to utilize fuzzy logic in decision trees to deal with the situations. This paper presents a survey of current methodology to design FDT (Fuzzy Decision Tree), v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012